package main.java.LeetCode.SolutionVersionTwo;



import main.java.LeetCode.CommonSolution.ListNode;

import java.net.URL;
import java.util.List;

public class Main {
    
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.minCostClimbingStairs(new int[]{1,100,1,1,1,100,1,1,100,1}));
    }




    static void showList(ListNode head){
        while (head!=null)
        {
            if(head.next!=null)
                System.out.print(head.val+"->");
            else
                System.out.print(head.val);
            head = head.next;
        }
    }
    static ListNode arrayToList(int[] arrays){
        ListNode head = null;
        ListNode headNode = null;
        for(int i:arrays){
            if(head==null){
                head = new ListNode(i);
                headNode = head;
            }
            else{
                head.next = new ListNode(i);
                head = head.next;
            }
        }
        return headNode;
    }
    static void showArrays(int[] nums){
        for(int i:nums){
            System.out.print(i+" ");
        }
    }
    static void showArrays(double[] nums){
        for(double i:nums){
            System.out.print(i+" ");
        }
    }
    static void showList(LRUCache.DLinkedNode head){
        while (head!=null)
        {
            if(head.next!=null)
                System.out.print(head.val+"->");
            else
                System.out.print(head.val);
            head = head.next;
        }
    }
    static void showArrays(int[][] nums){
        for (int[] num : nums) {
            for (int j = 0; j < nums.length; j++) {
                System.out.print(num[j] + " ");
            }
            System.out.println();
        }
    }
    static void showList(List<Integer> list){
        for(int i:list){
            System.out.print(i+" ");
        }
    }
}
